Global garbage collection for distributed heap storage systems
نویسندگان
چکیده
منابع مشابه
Heap Garbage Collection with Reference Counting
In algorithms based on reference counting, a garbage-collection decision has to be made whenever a pointer x→ y is about to be destroyed. At this time, the node y may become dead even if y’s reference count is not zero. This is because y may belong to a piece of cyclic garbage. Some aggressive collection algorithms will put y on the list of potential garbage regardless of y’s reference count. L...
متن کاملGarbage Collection in Distributed Object Systems
Large-scale, distributed computer systems are less reliable than their smallscale, non-distributed counterparts. A significant proportion of the reliability problems are due to the very poor scalability of manual storage management techniques—the reclamation of unused storage in particular. The bulk of automatic garbage reclamation in both message-passing and shared memory systems, with certain...
متن کاملCollection Schemes for Distributed Garbage
With the continued growth in interest in distributed systems, garbage collection is actively receiving attention by designers of distributed languages [Bal, 1990]. Distribution adds another dimension of complexity to an already complex problem. A comprehensive review and bibliography of distributed garbage collection literature up to 1992 is presented. As distributed collectors are largely base...
متن کاملRandomized Distributed Garbage Collection
With the explosive growth of the Internet and distributed computing, disributed garbage collection (DGC) has become a very important area of research. Single-processor garbage collection is by itself one of the challenging areas of research in computer science. In distributed environments, the problem of garbage collection becomes even harder and more challenging. This is mainly due to the addi...
متن کاملHybrid Regenerating Codes for Distributed Storage Systems
Distributed storage systems are mainly justified due to their ability to store data reliably over some unreliable nodes such that the system can have long term durability. Recently, regenerating codes are proposed to make a balance between the repair bandwidth and the storage capacity per node. This is achieved through using the notion of network coding approach. In this paper, a new variation ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Parallel Programming
سال: 1986
ISSN: 0885-7458,1573-7640
DOI: 10.1007/bf01414462